One dimensional consensus based algorithm for non-convex optimization
نویسندگان
چکیده
We analyze the consensus based optimization method proposed in Pinnau et al. (2017) one dimension. rigorously provide a quantitative error estimate between point and global minimizer of given objective function. Our analysis covers general functions; we do not require any structural assumption on
منابع مشابه
A non-consensus based distributed optimization algorithm
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization costs that are expressed as sums of functions, where each function is associated to an agent. The algorithm can be applied to continuously differentiable cost functions, it is not consensu...
متن کاملA non-heuristic distributed algorithm for non- convex constrained optimization
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization problems where the cost function is expressed as a sum of functions, and where each function is associated to an agent. In addition, the agents can have equality constraints as well. The a...
متن کاملAn Intelligent Approach Based on Meta-Heuristic Algorithm for Non-Convex Economic Dispatch
One of the significant strategies of the power systems is Economic Dispatch (ED) problem, which is defined as the optimal generation of power units to produce energy at the lowest cost by fulfilling the demand within several limits. The undeniable impacts of ramp rate limits, valve loading, prohibited operating zone, spinning reserve and multi-fuel option on the economic dispatch of practical p...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملWeak Solutions for One-dimensional Non-convex Elastodynamics
We explore local existence and properties of classical weak solutions to the initial-boundary value problem of a one-dimensional quasilinear equation of elastodynamics with non-convex stored-energy function, a model of phase transitions in elastic bars proposed by Ericksen [19]. The instantaneous formation of microstructures of local weak solutions is observed for all smooth initial data with i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2022
ISSN: ['1873-5452', '0893-9659']
DOI: https://doi.org/10.1016/j.aml.2021.107658